An Optimistic Web Service Selection using Multi Colony – Particle Swarm Optimization (MC – PSO) algorithm

نویسنده

  • T. Geetha
چکیده

Evolutionary algorithm and Swarm Intelligence algorithm (EA, SI), a part of Bio inspired optimization algorithm, have been widely used to solve numerous optimization problem in various science and engineering domains. This paper proposes a Multi Swarm Particle Swarm Optimization (MS-PSO) algorithm inspired by the animal collective behavior, the movement of the swarm and the intelligence of the swarm. The main concept of MS-PSO is to extend the single population PSO to the interacting multiswarm model. Through this multi-swarm cooperative approach, diversity in the whole swarm community can be maintained. Simultaneously, the swarm-to-swarm mechanism, drastically speeds up the swarm community to converge to the global optimum.MS-PSO algorithm solves the premature convergence problem. MS-PSO algorithm is tested by various benchmark functions.MS-PSO algorithm has competitive performance to other algorithms like Genetic algorithm (GA), Particle Swarm Optimization algorithm (PSO) in terms of accuracy and convergence speed.MS-PSO algorithm is specially designed to solve NP-Hard problems such as Optimization problem, Decision problem, Search problem, etc... The MS-PSO algorithm is also applied to Web Service Selection Problem (WSS). The WSS is an NP-Hard problem. Keywords— Animal collective behavior, Optimization, Evolutionary algorithm, Swarm Intelligence, Benchmark

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Evolutionary Algorithmic Approach based Optimal Web Service Selection for Composition with Quality of Service

Problem statement: Web service is a technology that provides flexibility and interconnection between different distributed applications over the Internet and intranets. When a client request cannot be satisfied by any individual service, existing web services can be combined into a composite web service. When there are a large number of Web services available, it is not easy to find an executio...

متن کامل

Semantic Web Service Selection Using Particle Swarm Optimization (Pso)

Service selection is a major constraint to discover and deliver services in a user friendly manner. In our system, we are enhancing and evaluating reliability of service discovery by adapting Particle Swarm Optimization (PSO) Algorithm in ontology repository to discover selected services. Our proposed technique is useful for ordinary search as well as semantic search corresponding to the servic...

متن کامل

Task Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids

In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...

متن کامل

Particle Swarm Optimization for Multi-Objective Web Service Location Allocation

Web service location allocation problem is an important problem in the modern IT industry. In this paper, the two major objectives, i.e. deployment cost and network latency, are considered simultaneously. In order to solve this new multi-objective problem effectively, we adopted the framework of binary Particle Swarm Optimization (PSO) due to its efficacy that has been demonstrated in many opti...

متن کامل

Task Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids

In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013